ognit ively to

نویسندگان

  • Claire Cardie
  • Wendy Lehnert
چکیده

This paper describes a cognitively plausible mechanism for systematically handling complex syntactic constructions within a semantic parser. More specifically, we show how these constructions are handled without a global syntactic grammar or syntactic parse tree representations and without sacrificing the benefits of semantically-oriented parsing. We evaluate the psychological validity of our architecture and conclude that it is a plausible computational model of human processing for an important class of embedded clause constructions. As a result, we achieve robust sentence processing capabilities not found in other parsers of its class.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Thermal Degradation of Polymers at High Temperatures

Work on thermal ~egradation of poly mers has prev iously been carried out aL lempC'mt ures up to about 500 G. In the present work the range has been extend cd to 850 0 C. Polystyrene was pyrolyzed in a vacuum and also in helium at atmos pheric pressure at 3620 and at 850 0 C. Analysis of t he volatile products indicates that higher temperatures a nd hi~her. pressures cause a greater fragmen tat...

متن کامل

Comparative Fun Analysis in the Innovative Playware Game Platform

This paper presents comparat ive fun experiments in the innovat ive playground ‘Playware’ which is a combinat ion of physical and virtual components for act ivat ing physical and social children’s play. For this purpose, a quant itat ive approach to entertainment modeling based on psychological studies in the field of computer games is int roduced. The paper invest igates quant itat ively how t...

متن کامل

On Topological Machines

A topological machine is a topo |ogized quas i -machine of G i n s b u r g and is defined by two cont inuous funct ions f and g, T ~ X x S ~ X , the s ta tet rans i t ion funct ion and the output funct ion, respect ively, where .X is a nonvoid T2-space, the state space, S and T are two topological semigroups , the i n p u t semigroup and the ou tpu t semigroup, respect ively, such tha t f (x, s...

متن کامل

Mathematical Aspects of Neural Networks

In this tutorial paper about mathematical aspects of neural networks, we will focus on two directions: on the one hand, we will motivate standard mathematical questions and well studied theory of classical neural models used in machine learning. On the other hand, we collect some recent theoretical results (as of beginning of 2003) in the respective areas. Thereby, we follow the dichotomy offer...

متن کامل

Adaptively Resizing Populations: Algorithm, Analysis, and First Results

Abs tract . Deciding on an appropriate population size for a given genet ic algor it hm (GA) applicat ion can oft en be crit ical to the success of the algorit hm . Too small, and t he GA can fall vict im to sampling erro r , affect ing the efficacy of it s search . Too large, and t he GA wastes computational resour ces. Although advice exists for sizing GA popula tions, much of this adv ice in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999